InforLorV4, Main, Exploration, bibRecord, 002721

Deciding knowledge in security protocols under some e-voting theories

Identifieur interne : 002721 ( Main/Exploration ); précédent : 002720; suivant : 002722

Deciding knowledge in security protocols under some e-voting theories

Auteurs : Mouhebeddine Berrima ; Narjes Ben Rajeb [Tunisie] ; Véronique Cortier [France]

Source :

RAIRO - Theoretical Informatics and Applications [ 0988-3754 ] ; 2011-09-14.

RBID : ISTEX:692B7DC20A5CE91538A47067E9EC93F412AC1224

Descripteurs français

Pascal (Inist)
- 68T15, Connaissance, Décidabilité, Déduction, Informatique théorique, Modélisation, Méthode formelle, Primitif, Procédure décision, Protocole cryptographique, Protocole sécurité, Temps polynomial, Théorie vote, Théorie équationnelle, Vote.
Wicri :
- topic : Vote.

English descriptors

KwdEn :
- Computer theory, Cryptographic protocol, Decidability, Deduction, Equational theory, Formal method, Knowledge, Modeling, Polynomial time, Primitive, Security protocol, Voting, Voting theory.

Abstract

In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several decision procedures have been developed so far for both notions but none of them can be applied in the context of e-voting protocols, which require dedicated cryptographic primitives. In this work, we show that both deduction and indistinguishability are decidable in polynomial time for two theories modeling the primitives of e-voting protocols.

Url:

DOI: 10.1051/ita/2011119

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Deciding knowledge in security protocols under some e-voting theories</title>
<author><name sortKey="Berrima, Mouhebeddine" sort="Berrima, Mouhebeddine" uniqKey="Berrima M" first="Mouhebeddine" last="Berrima">Mouhebeddine Berrima</name>
</author>
<author><name sortKey="Ben Rajeb, Narjes" sort="Ben Rajeb, Narjes" uniqKey="Ben Rajeb N" first="Narjes" last="Ben Rajeb">Narjes Ben Rajeb</name>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:692B7DC20A5CE91538A47067E9EC93F412AC1224</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1051/ita/2011119</idno>
<idno type="url">https://api.istex.fr/ark:/67375/80W-PH3Z94J5-Z/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001849</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001849</idno>
<idno type="wicri:Area/Istex/Curation">001830</idno>
<idno type="wicri:Area/Istex/Checkpoint">000621</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000621</idno>
<idno type="wicri:doubleKey">0988-3754:2011:Berrima M:deciding:knowledge:in</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00638515</idno>
<idno type="url">https://hal.inria.fr/inria-00638515</idno>
<idno type="wicri:Area/Hal/Corpus">001B04</idno>
<idno type="wicri:Area/Hal/Curation">001B04</idno>
<idno type="wicri:Area/Hal/Checkpoint">002055</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002055</idno>
<idno type="wicri:doubleKey">0988-3754:2011:Berrima M:deciding:knowledge:in</idno>
<idno type="wicri:Area/Main/Merge">002763</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:11-0430408</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000139</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000874</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000135</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000135</idno>
<idno type="wicri:doubleKey">0988-3754:2011:Berrima M:deciding:knowledge:in</idno>
<idno type="wicri:Area/Main/Merge">002859</idno>
<idno type="wicri:Area/Main/Curation">002721</idno>
<idno type="wicri:Area/Main/Exploration">002721</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Deciding knowledge in security protocols under some e-voting theories</title>
<author><name sortKey="Berrima, Mouhebeddine" sort="Berrima, Mouhebeddine" uniqKey="Berrima M" first="Mouhebeddine" last="Berrima">Mouhebeddine Berrima</name>
<affiliation><wicri:noCountry code="subField">berrima.mouheb@gmail.com</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Ben Rajeb, Narjes" sort="Ben Rajeb, Narjes" uniqKey="Ben Rajeb N" first="Narjes" last="Ben Rajeb">Narjes Ben Rajeb</name>
<affiliation wicri:level="3"><country xml:lang="fr">Tunisie</country>
<wicri:regionArea>LIP2, InstitutNational des Sciences Appliquées et de Technologie, Tunis</wicri:regionArea>
<placeName><settlement type="city">Tunis</settlement>
<region nuts="2">Gouvernorat de Tunis</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Loria, INRIA & CNRS, Nancy</wicri:regionArea>
<placeName><region type="region">Grand Est</region>
<region type="old region">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j" type="main">RAIRO - Theoretical Informatics and Applications</title>
<title level="j" type="abbrev">RAIRO-Theor. Inf. Appl.</title>
<title level="j" type="publisher-id">ita</title>
<idno type="ISSN">0988-3754</idno>
<idno type="eISSN">1290-385X</idno>
<imprint><publisher>EDP Sciences</publisher>
<date type="Final-Published" when="2011-09-14">2011-09-14</date>
<date type="ePublished" when="2011-08-26">2011-08-26</date>
<date type="Published" when="2011-07">2011-07</date>
<biblScope unit="vol">45</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="page" from="269">269</biblScope>
<biblScope unit="page" to="299">299</biblScope>
<biblScope unit="page-count">31</biblScope>
</imprint>
<idno type="ISSN">0988-3754</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0988-3754</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term>
<term>Cryptographic protocol</term>
<term>Decidability</term>
<term>Deduction</term>
<term>Equational theory</term>
<term>Formal method</term>
<term>Knowledge</term>
<term>Modeling</term>
<term>Polynomial time</term>
<term>Primitive</term>
<term>Security protocol</term>
<term>Voting</term>
<term>Voting theory</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>68T15</term>
<term>Connaissance</term>
<term>Décidabilité</term>
<term>Déduction</term>
<term>Informatique théorique</term>
<term>Modélisation</term>
<term>Méthode formelle</term>
<term>Primitif</term>
<term>Procédure décision</term>
<term>Protocole cryptographique</term>
<term>Protocole sécurité</term>
<term>Temps polynomial</term>
<term>Théorie vote</term>
<term>Théorie équationnelle</term>
<term>Vote</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Vote</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several decision procedures have been developed so far for both notions but none of them can be applied in the context of e-voting protocols, which require dedicated cryptographic primitives. In this work, we show that both deduction and indistinguishability are decidable in polynomial time for two theories modeling the primitives of e-voting protocols.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>Tunisie</li>
</country>
<region><li>Gouvernorat de Tunis</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
<li>Tunis</li>
</settlement>
</list>
<tree><noCountry><name sortKey="Berrima, Mouhebeddine" sort="Berrima, Mouhebeddine" uniqKey="Berrima M" first="Mouhebeddine" last="Berrima">Mouhebeddine Berrima</name>
</noCountry>
<country name="Tunisie"><region name="Gouvernorat de Tunis"><name sortKey="Ben Rajeb, Narjes" sort="Ben Rajeb, Narjes" uniqKey="Ben Rajeb N" first="Narjes" last="Ben Rajeb">Narjes Ben Rajeb</name>
</region>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002721 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002721 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:692B7DC20A5CE91538A47067E9EC93F412AC1224
   |texte=   Deciding knowledge in security protocols under some e-voting theories
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Deciding knowledge in security protocols under some e-voting theories

Deciding knowledge in security protocols under some e-voting theories

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.